Optimizing Spatial Declustering Weights – Comparison of Methods

نویسنده

  • G. Dubois
چکیده

Analysis of a spatial phenomenon is to a great extent affected by the frequent irregular structures and/or the preferential clustering of the sampling schemes. To obtain representative statistics for an area of interest, the influence of clustered measurements needs to be reduced by attributing them lower weights. In this case study, two standard methods, the polygonal and the cell-declustering methods, are confronted with the recently proposed Coefficient of Representativity. The last combines Thiessen polygons with nearest neighbours distances and is further coupled with information provided by the borders of the region of interest. The relative performance of these methods is assessed through an estimation problem of the average elevation of several subsets of a Digital Elevation Model of Switzerland. The results are showing for this case study that the Coefficient of Representativity generated overall better results when confronted to the other methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems

Declustering and load-balancing are important issues in designing a high performance geographic information system (HPGIS) which is a central component of many interactive applications such as real-time terrain visualization. The current literature provides eecient methods for declustering spatial point-data. However, there has been little work towards developing eecient declustering methods fo...

متن کامل

Parallelizing Spatial Databases on Shared-Memory Multiprocessors

Several emerging visualization applications such as ight simulators, distributed interactive simulation (DIS), and virtual reality are using geographic information systems (GISs) for high-delity representation of actual terrains. These applications impose stringent performance and response-time restrictions which require parallelization of the GIS and shared-memory multiprocessors (SMPs) are we...

متن کامل

Declustering Spatial Objects by Clustering for Parallel Disks

In this paper, we propose an eÆcient declustering algorithm which is adaptable in di erent data distribution. Previous declustering algorithms have a potential drawback by assuming data distribution is uniform. However, our method shows a good declustering performance for spatial data regardless of data distribution by taking it into consideration. First, we apply a spatial clustering algorithm...

متن کامل

Declustering and Debiasing

Strategic project decisions are based on the distributions global variables, for example, total mineable resource, or recoverable oil volume. These global variables distributions are very sensitive to rock type proportions and the histograms of continuous variables. Representivity of the input one point statistics is important in all spatial models. The process of assembling representative one ...

متن کامل

High Performance Geographic Information Systems: Experiences with a Shared Address Space Architecture

Several emerging visualization applications such as ight simulators, distributed interactive simulation (DIS), and virtual reality are using geographic information systems (GISs) for high-delity representation of actual terrains. These applications impose stringent performance and response-time restrictions which can be met via parallelization of the GIS. Currently, we are developing a high per...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003